AGT basis in SCFT for c = 3/2 and Uglov polynomials
نویسندگان
چکیده
منابع مشابه
passivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
investigating the integration of translation technologies into translation programs in iranian universities: basis for a syllabus design in translation technology
today, information technology and computers are indispensable tools of any profession and translation technologies have become an indispensable part of translator’s workstation. with the increasing demands for high productivity and speed as well as consistency and with the rise of new demands for translation and localization, it is necessary for translators to be familiar with market demands an...
the search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولA New Basis for Discrete Analytic Polynomials
A new basis {irk(z)}t.o for discrete analytic polynomials is presented for which the series 2k-o ak7Tk(z) converges absolutely to a discrete analytic function in the upper right quarter lattice whenever lim | ak \" k = 0. Introduction Let Z be the group of integers and consider functions / : Z X Z ^ C such that (1.1) f(x, y) + if(x + 1, y) / (* + 1, y + 1) if(x, y + 1) = 0 for every (x, y ) £ Z...
متن کاملFast Gröbner Basis Computation for Boolean Polynomials
We introduce the Macaulay2 package BooleanGB, which computes a Gröbner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B
سال: 2020
ISSN: 0550-3213
DOI: 10.1016/j.nuclphysb.2020.115133